Solving an infinite-dimensional problem of location-allocation with fuzzy parameters
نویسندگان
چکیده
منابع مشابه
The Capacitated Location-Allocation Problem with Interval Parameters
In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...
متن کاملSolving a location-allocation problem by a fuzzy self-adaptive NSGA-II
This paper proposes a modified non-dominated sorting genetic algorithm (NSGA-II) for a bi-objective location-allocation model. The purpose is to define the best places and capacity of the distribution centers as well as to allocate consumers, in such a way that uncertain consumers demands are satisfied. The objectives of the mixed-integer non-linear programming (MINLP) model are to (1) minimize...
متن کاملAn Investigation on Multi-Criteria Location Problem with Fuzzy Parameters
This paper considers to locate multiple new uncapacitated facilities on a plane bounded by a convex polygon under minisum, maximin and minimax criteria to meet fuzzy demands of customers. Some fuzzy programming models are initiated for this problem, where Euclidean distances are assumed as the scenario. And a hybrid intelligent algorithm is designed for solving the proposed models.
متن کاملthe capacitated location-allocation problem with interval parameters
in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...
متن کاملSolving a multicommodity location-allocation problem with non linear costs
This paper deals with a planning problem arising in large logistics companies. The problem consists in defining the optimal number of depots, their location, and their size as well as the routing decisions. Economies of scale are present both in the transportation and in the depots operations. The paper proposes an exact algorithm and an efficient heuristic based on the integration of tabu sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of applied mathematics and mathematic modeling
سال: 2018
ISSN: 2074-5893
DOI: 10.15421/321810